A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes
نویسندگان
چکیده
Hybrid EL-TBoxes combine general concept inclusions (GCIs), which are interpreted with descriptive semantics, with cyclic concept definitions, which are interpreted with greatest fixpoint (gfp) semantics. We introduce a proof-theoretic approach that yields a polynomial-time decision procedure for subsumption in EL w.r.t. hybrid TBoxes, and present preliminary experimental results regarding the performance of the reasoner Hyb that implements this decision procedure.
منابع مشابه
Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes
We perform an exhaustive study of the complexity of subsumption in the EL family of lightweight description logics w.r.t. acyclic and cyclic TBoxes. It turns out that there are interesting members of this family for which subsumption w.r.t. cyclic TBoxes is tractable, whereas it is EXPTIME-complete w.r.t. general TBoxes. For other extensions that are intractable w.r.t. general TBoxes, we establ...
متن کاملOptimization and Implementation of Subsumption Algorithms for the Description Logic El with Cyclic Tboxes and General Concept Inclusion Axioms
The subsumption problem in the description logic (DL) EL has been shown to be polynomial regardless of whether cyclic or acyclic TBoxes are used. Recently, it was shown that the problem remains tractable even when admitting general concept inclusion (GCI) axioms. Motivated by its nice complexity and sufficient expressiveness for some applications, we propose three decision procedures for comput...
متن کاملComplexity of Subsumption in Extensions of EL
During the last years, it has been shown that the description logic EL is well-suited for tractable reasoning. In particular, reasoning is even tractable w.r.t. general concept inclusion axioms, and various extensions of EL and their effects on the complexity of subsumption w.r.t. general concept inclusion axioms have been studied. In this thesis, we sharpen the border between tractability and ...
متن کاملFoundations for the Logical Difference of EL-TBoxes
We investigate the logical difference problem between general EL-TBoxes. The logical difference is the set of concept subsumptions that are logically entailed by a first TBox but not by a second one. We show how the logical difference between two EL-TBoxes can be reduced to fixpoint reasoning w.r.t. EL-TBoxes. Entailments of the first TBox can be represented by subsumptions of least fixpoint co...
متن کاملTechnische Universität
In recent years, the Description Logic EL has received a significant interest. It has been shown to be useful as a knowledge representation formalism, to define large biomedical ontologies. Moreover, important inference problems like subsumption have been shown to be decidable in polynomial time in EL. In particular, unification in EL can be used to detect redundancies in big ontologies. The un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008